
Unifying explicit and implicit feedback for collaborative filtering.

Transfer Learning for Collective Link Prediction in Multiple Heterogenous Domains.
Link prediction is a key technique in many applications such as recommender systems, where potential links between users and items need to be predicted. A challenge in link prediction is the data sparsity problem. In this paper, we address this problem by jointly considering multiple heterogeneous link prediction tasks such as predicting links between users and different types of items including books, movies and songs, which we refer to as the collective link prediction (CLP) problem. We propose a nonparametric Bayesian framework for solving the CLP problem, which allows knowledge to be adaptively transferred across heterogeneous tasks while taking into account the similarities between tasks. We learn the inter-task similarity automatically. We also introduce link functions for different tasks to correct their biases and skewness of distributions in their link data. We conduct experiments on several real world datasets and demonstrate significant improvements over several existing state-of-the-art methods. 1.
Online evolutionary collaborative filtering.

Social Learning.
www.ifpri.org IFPRI’s Discussion Papers contain preliminary material and research results. They have not been subject to formal review by IFPRI’s Publications Review Committee. They are circulated in order to stimulate discussion and critical comment.
Probabilistic latent preference analysis for collaborative filtering.

Knowledge Transfer among Heterogeneous Information Networks.

One%2DClass Collaborative Filtering.
This paper is motivated by the industrial research problem of designing a real-world recommender system for a large Information Technology (IT) company. Given historical records of client purchases, compactly represented as a sparse client-times-product “who-bought-what ” binary matrix, the goal is to build a model that provides recommendations for what products should be sold next to the existing client base. Such a problem may naturally be formulated as a collaborative filtering task. However, this is a one-class setting, that is, if a client has not bought a product yet, it does not imply that the client has a low propensity to potentially buy that product later. In the absence of explicitly labeled negative examples, one may resort to considering zero-valued client-product pairs as either missing data or as surrogate negative instances. In this paper, we outline an approach to explicitly deal with this kind of ambiguity by instead treating zero-valued pairs as optimization variables. These variables are optimized in conjunction with learning a weighted, low-rank non-negative matrix factorization (NMF) of the client-product matrix. The proposed algorithm alternates NMF optimization with deterministicannealing/continuation techniques designed for global minimization of combinatorial and non-convex objective functions. Experimental results show that our approach can give significantly better recommendations in comparison to various competing alternatives on a one-class collaborative filtering task.
EigenRank a ranking%2Doriented approach to collaborative filtering.

Real world activity recognition with multiple goals.
Recognizing and understanding the activities of people from sensor readings is an important task in ubiquitous computing. Activity recognition is also a particularly difficult task because of the inherent uncertainty and complexity of the data collected by the sensors. Many researchers have tackled this problem in an overly simplistic setting by assuming that users often carry out single activities one at a time or multiple activities consecutively, one after another. However, so far there has been no formal exploration on the degree in which humans perform concurrent or interleaving activities, and no thorough study on how to detect multiple goals in a real world scenario. In this article, we ask the fundamental questions of whether users often carry out multiple concurrent and interleaving activities or single activities in their daily life, and if so, whether such complex behavior can be detected accurately using sensors. We define several classes of complexity levels under a goal taxonomy that describe different granularities of activities, and relate the recognition accuracy with different complexity levels or granularities. We present a theoretical framework for recognizing multiple concurrent and interleaving activities, and evaluate the framework in several real-world ubiquitous computing environments.
